
/*

 1) boolean isBST(NODE<T> node)
 2) boolean isBalancedBT(NODE<T> node)
 3) void array2Tree(int a[])           array -> tree
 4) int[] tree2Array(Tree a)		   tree  -> array
 5) Node<T> LCA(Node<T> a, Node<T>b ) find lowest comman acncestor of tow nodes
 6) Node<T> nextNode (Node<T> node)   find the next node
 7) Permutation from 1.  0-9   2.  4*3*3;
 */



//http://collabedit.com/gs3ep
public class Assignment {

//	calculate the height of the tree

	class Node
	{
	    public Node left;
	    public Node right;
	    int data;
	}

	int height(Node node)
	{
		return 0;
	}

	boolean isBalanced( Node node)
	{
		return true;
	}

	boolean isBST(Node node)
	{
		return true; 
	}

}
